Multigraph augmentation under biconnectivity and general edge-connectivity requirements
نویسندگان
چکیده
منابع مشابه
Multigraph augmentation under biconnectivity and general edge-connectivity requirements
Given an undirected multigraph G = (V;E) and a requirement function r : 0 V 2 1 ! Z + (where 0 V 2 1 is the set of all pairs of vertices and Z + is the set of nonnegative integers), we consider the problem of augmenting G by the smallest number of new edges so that the local edge-connectivity and vertex-connectivity b e t ween every pair x; y 2 V become at least r (x; y) and two, respectively. ...
متن کاملEdge-Connectivity Augmentation Problems
The problem in which the object is to add a minimum weight set of edges to a graph so as to satisfy a given condition is called the augmentation problem. This problem has a wide variety [3-5, 10, 11, 14-201. If such a given condition is concerned with the vertexor edge-connectivity of a graph then the problem is referred to as the (vertexor edge-) connectivity augmentation problem. Frank and Ch...
متن کاملA Hybrid GA for the Edge-Biconnectivity Augmentation Problem
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-biconnectivity augmentation (E2AUG) problem, in which a given graph G0(V, E0) needs to be augmented by the cheapest possible set of edges AUG so that a single edge deletion does not disconnect G0. The new approach is bas...
متن کاملEvolutionary local search for the edge-biconnectivity augmentation problem
This paper considers the problem of augmenting a given graph by a cheapest possible set of additional edges in order to make the graph edge-biconnected. An application is the extension of an existing communication network to become robust against single link-failures. An evolutionary algorithm (EA) is presented which includes an effective preprocessing of the problem data and a local improvemen...
متن کاملEvolutionary algorithms for the edge biconnectivity augmentation problem
A graph is edge-biconnected i f i t requires the removal ofat least hvo edges to disconnect it. Assume that we have weighted graph that is not biconnected, and an additional set of augmentation edges. The (NP-hard) edge biconnectivify augmentafion problem is to select a minimal subset of the augmentation edges, whose inclusion will cause fhe graph to be biconnected. This paper explores the appl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2001
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.4